//        https://www.nowcoder.com/practice/65ade309fa4d4067a9add749721bfdc0





#include <iostream>
using namespace std;

const int N = 1000000;
bool dp(int nums[], int n)
{
    int dp[N] = { 0 };
    int sum = 0;
    for (int i = 0; i < n; i++)
    {
        sum += nums[i];
    }
    if (sum % 2 == 1)
        return false;

    int target = sum / 2;
    for (int i = 0; i < n; i++)
        for (int j = target; j >= nums[i]; j--)
        {
            dp[j] = max(dp[j], dp[j - nums[i]] + nums[i]);
        }

    return dp[target] == target;
}

int main()
{
    int n;
    cin >> n;
    int nums[n];
    for (int i = 0; i < n; i++)
        cin >> nums[i];

    if (dp(nums, n))
        cout << "true";
    else
        cout << "false";

    return 0;
}